Random Feature Maps for the Itemset Kernel
نویسندگان
چکیده
منابع مشابه
Spherical Structured Feature Maps for Kernel Approximation
We propose Spherical Structured Feature (SSF) maps to approximate shift and rotation invariant kernels as well as b-order arc-cosine kernels (Cho & Saul, 2009). We construct SSF maps based on the point set on d − 1 dimensional sphere Sd−1. We prove that the inner product of SSF maps are unbiased estimates for above kernels if asymptotically uniformly distributed point set on Sd−1 is given. Acco...
متن کاملCompact Random Feature Maps
Kernel approximation using random feature maps has recently gained a lot of interest. This is mainly due to their applications in reducing training and testing times of kernel based learning algorithms. In this work, we identify that previous approaches for polynomial kernel approximation create maps that can be rank deficient, and therefore may not utilize the capacity of the projected feature...
متن کاملRandom Feature Maps for Dot Product Kernels
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line of work and present low distortion embeddings for dot product kernels into linear Euclidean spaces. We base our results on a classical result in harmonic anal...
متن کاملRandom Feature Maps for Dot Product Kernels Supplementary Material
This document contains detailed proofs of theorems stated in the main article entitled Random Feature Maps for Dot Product Kernels. 1 Proof of Theorem 1 We first recollect Schoenberg’s result in its original form Theorem 1 (Schoenberg (1942), Theorem 2). A function f : [−1, 1]→ R constitutes a positive definite kernel K : S∞ × S∞ → R, K : (x,y) 7→ f(〈x,y〉) iff f is an analytic function admittin...
متن کاملLarge-scale Online Kernel Learning with Random Feature Reparameterization
A typical online kernel learning method faces two fundamental issues: the complexity in dealing with a huge number of observed data points (a.k.a the curse of kernelization) and the difficulty in learning kernel parameters, which often assumed to be fixed. Random Fourier feature is a recent and effective approach to address the former by approximating the shift-invariant kernel function via Boc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33013199